#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
char a[maxn],b[maxn];
int main(void)
{
  ///cin.tie(0);std::ios::sync_with_stdio(false);
  LL n;n=read();
  for(LL i=1;i<=n;i++){
    cin>>a[i];
  }
  for(LL i=1;i<=n;i++){
    cin>>b[i];
  }
  LL sum=0;
  for(LL i=1;i<=n;i++){
    if(a[i]==b[i]) sum+=2;
    else if(a[i]!=b[i]) sum+=1;
  }
  cout<<sum<<" "<<0<<endl;
return 0;
}
